Global rigidity of 2-dimensional direction-length frameworks with connected rigidity matroids

نویسندگان

چکیده

A 2-dimensional direction-length framework (G,p) consists of a multigraph G=(V;D,L) with realisation p:V→R2. The edges G represent geometric constraints: in L have fixed length, and D gradient. is globally rigid if every (G,q) which satisfies the same constraints as can be obtained from by an isometry plane. We characterise global rigidity for class frameworks p generic matroid connected. Specifically, we show that such are only both non-empty, 2-separation direction-balanced. This extends previous work Jackson Jordán (2010).

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Operations Preserving Global Rigidity of Generic Direction-Length Frameworks

A two-dimensional direction-length framework is a pair (G, p), where G = (V ;D,L) is a graph whose edges are labeled as ‘direction’ or ‘length’ edges, and a map p from V to R. The label of an edge uv represents a direction or length constraint between p(u) and p(v). The framework (G, p) is called globally rigid if every other framework (G, q) in which the direction or length between the endvert...

متن کامل

Necessary Conditions for the Global Rigidity of Direction-Length Frameworks

It is an intriguing open problem to give a combinatorial characterisation or polynomial algorithm for determining when a graph is globally rigid in R. This means that any generic realisation is uniquely determined up to congruence when each edge represents a fixed length constraint. Hendrickson gave two natural necessary conditions, one involving connectivity and the other redundant rigidity. I...

متن کامل

Generic global rigidity of body-bar frameworks

A basic geometric question is to determine when a given framework G(p) is globally rigid in Euclidean space Rd, where G is a finite graph and p is a configuration of points corresponding to the vertices of G. G(p) is globally rigid in Rd if for any other configuration q for G such that the edge lengths of G(q) are the same as the corresponding edge lengths of G(p), then p is congruent to q. A f...

متن کامل

Connected rigidity matroids and unique realizations of graphs

A d-dimensional framework is a straight line realization of a graph G in Rd . We shall only consider generic frameworks, in which the co-ordinates of all the vertices of G are algebraically independent. Two frameworks for G are equivalent if corresponding edges in the two frameworks have the same length. A framework is a unique realization of G in Rd if every equivalent framework can be obtaine...

متن کامل

Rigidity Theory for Matroids

Combinatorial rigidity theory seeks to describe the rigidity or flexibility of bar-joint frameworks in R in terms of the structure of the underlying graph G. The goal of this article is to broaden the foundations of combinatorial rigidity theory by replacing G with an arbitrary representable matroid M . The ideas of rigidity independence and parallel independence, as well as Laman’s and Recski’...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Applied Mathematics

سال: 2023

ISSN: ['1872-6771', '0166-218X']

DOI: https://doi.org/10.1016/j.dam.2022.10.017